翻訳と辞書 Words near each other ・ Longepierre ・ Longer ・ Longer Fuse ・ Longer Heavier Vehicle ・ Longer Views ・ Longerak ・ Longerakvatnet ・ Longerhouw ・ Longeron ・ Longes ・ Longessaigne ・ Longest alternating subsequence ・ Longest bar in Australia ・ Longest bridge ・ Longest climbing salamander ・ Longest common subsequence problem ・ Longest common substring problem ・ Longest Day ・ Longest Day of Nelson ・ Longest element of a Coxeter group ・ Longest English sentence ・ Longest fence in the world ・ Longest increasing subsequence ・ Longest linear sequence ・ Longest NCAA Division I football winning streaks ・ Longest Night ・ Longest Night Service ・ Longest palindromic substring ・ Longest path problem ・ Longest prefix match Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Longest common subsequence problem ： ウィキペディア英語版 Longest common subsequence problem The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from problems of finding common substrings: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The longest common subsequence problem is a classic computer science problem, the basis of data comparison programs such as the diff utility, and has applications in bioinformatics. It is also widely used by revision control systems such as Git for reconciling multiple changes made to a revision-controlled collection of files. == Complexity == For the general case of an arbitrary number of input sequences, the problem is NP-hard. When the number of sequences is constant, the problem is solvable in polynomial time by dynamic programming (see ''Solution'' below). Assume you have $N$ sequences of lengths $n\_1,\; ...,\; n\_N$. A naive search would test each of the $2^$ subsequences of the first sequence to determine whether they are also subsequences of the remaining sequences; each subsequence may be tested in time linear in the lengths of the remaining sequences, so the time for this algorithm would be :$O\backslash left(\; 2^\; \backslash sum\_\; n\_i\backslash right).$ For the case of two sequences of ''n'' and ''m'' elements, the running time of the dynamic programming approach is O(''n'' × ''m''). For an arbitrary number of input sequences, the dynamic programming approach gives a solution in :$O\backslash left(N\; \backslash prod\_^\; n\_i\backslash right).$ There exist methods with lower complexity,〔 〕 which often depend on the length of the LCS, the size of the alphabet, or both. Notice that the LCS is not necessarily unique; for example the LCS of "ABC" and "ACB" is both "AB" and "AC". Indeed, the LCS problem is often defined to be finding ''all'' common subsequences of a maximum length. This problem inherently has higher complexity, as the number of such subsequences is exponential in the worst case, even for only two input strings. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Longest common subsequence problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.